Measurement Scheme Improving for State Estimation Using Stochastic Tabu Search

نویسنده

  • T. Kerdchuen
چکیده

This paper proposes the stochastic tabu search (STS) for improving the measurement scheme for power system state estimation. If the original measured scheme is not observable, the additional measurements with minimum number of measurements are added into the system by STS so that there is no critical measurement pair. The random bit flipping and bit exchanging perturbations are used for generating the neighborhood solutions in STS. The Pδ observable concept is used to determine the network observability. Test results of 10 bus, IEEE 14 and 30 bus systems are shown that STS can improve the original measured scheme to be observable without critical measurement pair. Moreover, the results of STS are superior to deterministic tabu search (DTS) in terms of the best solution hit. Keywords—Measurement Scheme, Power System State Estimation, Network Observability, Stochastic Tabu Search (STS).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

POWER SYSTEM STATE ESTIMATION A. Power System State Estimation The conventional method for power system state estimation is the weight least squares (WLS) state estimation

This paper proposes the stochastic tabu search (STS) for improving the measurement scheme for power system state estimation. If the original measured scheme is not observable, the additional measurements with minimum number of measurements are added into the system by STS so that there is no critical measurement pair. The random bit flipping and bit exchanging perturbations are used for generat...

متن کامل

Reactive Stochastic Local Search Algorithms for the Genomic Median Problem

The genomic median problem is an optimization problem inspired by a biological issue: it aims to find the chromosome organization of the common ancestor to multiple living species. It is formulated as the search for a genome that minimizes a rearrangement distance measure among given genomes. Several attempts have been reported for solving this NP-hard problem. These range from simple heuristic...

متن کامل

Tabu Search for SAT

In this paper tabu search for SAT is investi gated from an experimental point of view To this end TSAT a basic tabu search algorithm for SAT is introduced and compared with Selman et al Random Walk Strategy GSAT procedure in short RWS GSAT TSAT does not involve the ad ditional stochastic process of RWS GSAT This should facilitate the understanding of why simple local search methods for SAT work...

متن کامل

A Tabu Search Approach based on Strategic Vibration for Competitive Facility Location Problems with Random Demands

This paper proposes a new location problem of competitive facilities, e.g. shops and stores, with uncertain demands in the plain. By representing the demands for facilities as random variables, the location problem is formulated to a stochastic programming problem, and it is reformulated to three deterministic programming problems: expectation maximizing problem, probability maximizing problem,...

متن کامل

Reinforcement Learning and Reactive Search: an adaptive MAX-SAT solver

This paper investigates Reinforcement Learning (RL) applied to online parameter tuning in Stochastic Local Search (SLS) methods. In particular, a novel application of RL is proposed in the Reactive Tabu Search (RTS) scheme, where the appropriate amount of diversification in prohibition-based local search is adapted in a fast online manner to the characteristics of a task and of the local config...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009